Austria : No one loses , all win ?

Win Sequences for Round-robin Tournaments

Each of n teams numbered 1, 2, · · · , n play each of the other n− 1 teams exactly one time for a total of ( n 2 ) = n(n − 1)/2 games. Each game produces a win for one team and a loss for the other team. Define (wi, li), i = 1, 2, · · · , n, to be the win-loss records for the teams. That is, team i, i = 1, 2, · · · , n, wins wi games and loses li games where wi + li = n− 1. Of course, n ∑

Competitive procurement with corruption

We study competitive procurement administered by a corrupt agent who is willing to manipulate his evaluation of contract proposals in exchange for bribes. With complete information and no corruption, the efficient firm will win the contract for sure. If the agent is corrupt and has large manipulation power, however, bribery makes it costly for the efficient firm to secure a sure win, so in equi...

Management and Market Reactions to Litigation: Do Shareholders Win When the Company Loses?

From Heaps of Matches to the Limits of Computability

We study so-called invariant games played with a fixed number d of heaps of matches. A game is described by a finite list M of integer vectors of length d specifying the legal moves. A move consists in changing the current game-state by adding one of the vectors in M, provided all elements of the resulting vector are nonnegative. For instance, in a two-heap game, the vector (1,−2) would mean ad...

Facial appearance affects voting decisions

Human groups are unusual among primates in that our leaders are often democratically selected. Faces affect hiring decisions and could influence voting behavior. Here, we show that facial appearance has important effects on choice of leader. We show that differences in facial shape alone between candidates can predict who wins or loses in an election (Study 1) and that changing context from war...